#include <bits/stdc++.h>
using namespace std;

#define int int64_t
#define endl "\n"

using PII = pair<int, int>;
using TII = tuple<int, int, int>;
template<class T>
using V = vector<T>;
using i64 = long long;
using i128 = __int128;
using u64 = unsigned long long;

#define FOR(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)
#define FOR2(i, a, b, c) for (int i = (int)(a); i <= (int)(b); i += c)
#define FORD(i, b, a) for (int i = (int)(a); i >= (int)(b); i--)
#define FORD2(i, b, a, c) for (int i = (int)(a); i >= (int)(b); i -= c)
#define ALL(a) a.begin(), a.end()
#define RALL(a) a.rbegin(), a.rend()
#define lowbit(x) ((x)&(-x))
#define RE return;
#define Yes cout << "Yes" << endl;
#define YES cout << "YES" << endl;
#define No cout << "No" << endl;
#define NO cout << "NO" << endl;
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define sz size()

void solve () {
    int n;
    double x1, y1, x2, y2;
    cin >> n >> x1 >> y1 >> x2 >> y2;

    V<double>w (n), s (n + 1, 0);

    FOR (i, 0, n - 1)cin >> w[i];

    FOR (i, 1, n)s[i] = s[i - 1] + w[i - 1];

    double d = sqrt ((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));

    if (n == 1) {
        if (d == w[0]) {
            YES;
        } else {
            NO;
        }
        RE;
    }

    double mx = max (d, *max_element (ALL (w)));

    if (s[n] + d - mx >= mx) {
        YES;
    } else {
        NO;
    }

}

signed main () {
    int Task = 1;

    ios::sync_with_stdio (false);
    cin.tie (nullptr);
    cin >> Task;

    while (Task--) {
        solve ();
    }

    return 0;
}